#!/usr/bin/env python3

"""
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in sums such
that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

Maybe Hard
"""

class Solution:
    def four_sum(self, nums, target):
        nums.sort()
        


if __name__ == '__main__':
    pass
